Many-Sorted First-Order Logic Database Language
نویسندگان
چکیده
منابع مشابه
Many-Sorted First-Order Logic Database Language
ion mechanism. Many database researchers have used OSFOL to view the Relational Data Model (RDM) ; however, no RDM has been modelled by MSFOL. This paper first gives a formal definition for MSFOL and then its advantages of expressiveness and of abstraction are illustrated. Two reduction algorithms which can transform an MSFOL-based language into\from an OSFOL-based language are given. The seman...
متن کاملEncoding TLA+ set theory into many-sorted first-order logic
We present an encoding of Zermelo-Fraenkel set theory into many-sorted first-order logic, the input language of state-of-the-art smt solvers. This translation is the main component of a back-end prover based on smt solvers in the TLA Proof System.
متن کاملEncoding TLA ^+ + into Many-Sorted First-Order Logic
This paper presents an encoding of a non-temporal fragment of the TLA language, which includes untyped set theory, functions, arithmetic expressions, and Hilbert’s ε operator, into many-sorted firstorder logic, the input language of state-of-the-art smt solvers. This translation, based on encoding techniques such as boolification, injection of unsorted expressions into sorted languages, term re...
متن کاملInsufficiency of First Order Logic as a Database Query Language
The paper explores “logic+control” programming paradigm, applied to a relational domain. Even though it looks natural to utilize first order logic as a database query language, the paper reveals some shortcomings of such an approach. Particular attention is paid to: a) the semantics of negation and other non-monotonic reasoning notions, b) infinite or time consuming recursions, c) embedded PROL...
متن کاملExistential rigidity and many modalities in order-sorted logic
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (called sort-hierarchy). However, this logic cannot represent more complex sorted expressions when they are true in any possible world (as rigid) or some possible worlds (as modality) such as time, space, belief, or situ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1992
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/35.2.129